全文获取类型
收费全文 | 5932篇 |
免费 | 640篇 |
国内免费 | 557篇 |
专业分类
电工技术 | 435篇 |
综合类 | 565篇 |
化学工业 | 163篇 |
金属工艺 | 60篇 |
机械仪表 | 248篇 |
建筑科学 | 312篇 |
矿业工程 | 81篇 |
能源动力 | 142篇 |
轻工业 | 40篇 |
水利工程 | 230篇 |
石油天然气 | 151篇 |
武器工业 | 71篇 |
无线电 | 622篇 |
一般工业技术 | 354篇 |
冶金工业 | 74篇 |
原子能技术 | 40篇 |
自动化技术 | 3541篇 |
出版年
2024年 | 6篇 |
2023年 | 69篇 |
2022年 | 66篇 |
2021年 | 96篇 |
2020年 | 100篇 |
2019年 | 145篇 |
2018年 | 98篇 |
2017年 | 177篇 |
2016年 | 172篇 |
2015年 | 227篇 |
2014年 | 300篇 |
2013年 | 359篇 |
2012年 | 330篇 |
2011年 | 446篇 |
2010年 | 340篇 |
2009年 | 425篇 |
2008年 | 458篇 |
2007年 | 521篇 |
2006年 | 415篇 |
2005年 | 369篇 |
2004年 | 295篇 |
2003年 | 265篇 |
2002年 | 229篇 |
2001年 | 160篇 |
2000年 | 146篇 |
1999年 | 134篇 |
1998年 | 113篇 |
1997年 | 120篇 |
1996年 | 102篇 |
1995年 | 71篇 |
1994年 | 90篇 |
1993年 | 60篇 |
1992年 | 40篇 |
1991年 | 43篇 |
1990年 | 18篇 |
1989年 | 24篇 |
1988年 | 19篇 |
1987年 | 13篇 |
1986年 | 4篇 |
1985年 | 11篇 |
1984年 | 8篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 7篇 |
1980年 | 5篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1974年 | 3篇 |
1962年 | 2篇 |
排序方式: 共有7129条查询结果,搜索用时 15 毫秒
1.
Combinatorial auction is a useful trade manner for transportation service procurements in e-marketplaces. To enhance the competition of combinatorial auction, a novel auction mechanism of two-round bidding with bundling optimization is proposed. As the recommended the auction mechanism, the shipper/auctioneer integrates the objects into several bundles based on the bidding results of first round auction. Then, carriers/bidders bid for the object bundles in second round. The bundling optimization is described as a multi-objective model with two criteria on price complementation and combination consistency. A Quantum Evolutionary Algorithm (QEA) with β-based rotation gate and the encoding scheme based on non-zero elements in complementary coefficient matrix is developed for the model solution. Comparing with a Contrast Genetic Algorithm, QEA can achieve better computational performances for small and middle size problems. 相似文献
2.
This paper proposes the application of Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in fixed structure H∞ loop shaping controller design. Integral Time Absolute Error (ITAE) performance requirement is incorporated as a constraint with an objective of maximization of stability margin in the fixed structure H∞ loop shaping controller design problem. Pneumatic servo system, separating tower process and F18 fighter aircraft system are considered as test systems. The CMA-ES designed fixed structure H∞ loop-shaping controller is compared with the traditional H∞ loop shaping controller, non-smooth optimization and Heuristic Kalman Algorithm (HKA) based fixed structure H∞ loop shaping controllers in terms of stability margin. 20% perturbation in the nominal plant is used to validate the robustness of the CMA-ES designed H∞ loop shaping controller. The effect of Finite Word Length (FWL) is considered to show the implementation difficulties of controller in digital processors. Simulation results demonstrated that CMA-ES based fixed structure H∞ loop shaping controller is suitable for real time implementation with good robust stability and performance. 相似文献
3.
随着无源光网络的发展,光纤-无线网络能同时支持集中式云和边缘云计算技术,成为一种具有发展前景的网络结构。但是,现有的基于光纤-无线网络的任务协同计算卸载研究主要以最小化移动设备的能耗为目标,忽略了实时性高的任务的需求。针对实时性高的任务,提出了以最小化任务的总处理时间为目标的集中式云和边缘云协同计算卸载问题,并对其进行形式化描述。同时,通过将该问题归约为装箱问题,从而证明其为NP难解问题。提出一个启发式协同计算卸载算法,该算法通过比较不同卸载策略的任务处理时间,优先选择时间最短的任务卸载策略。同时,提出一个定制的遗传算法,获得一个更优的任务卸载策略。实验结果表明,与现有的算法相比,本文提出的启发式算法得到的任务卸载策略平均减少4.34%的任务总处理时间,而定制的遗传算法的卸载策略平均减少18.41%的任务总处理时间。同时,定制的遗传算法的卸载策略与本文提出的启发式算法相比平均减少14.49%的任务总处理时间。 相似文献
4.
In this work, novel application of evolutionary computational heuristics is presented for parameter identification problem of nonlinear Hammerstein controlled auto regressive auto regressive (NHCARAR) systems through global search competency of backtracking search algorithm (BSA), differential evolution (DE) and genetic algorithms (GAs). The mean squared error metric is used for the fitness function of NHCARAR system based on difference between actual and approximated design variables. Optimization of the cost function is conducted with BSA for NHCARAR model by varying degrees of freedom and noise variances. To verify and validate the worth of the presented scheme, comparative studies are carried out with its counterparts DE and GAs through statistical observations by means of weight deviation factor, root of mean squared error, and Thiel’s inequality coefficient as well as complexity measures. 相似文献
5.
6.
Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed. 相似文献
7.
In this paper, we investigate how adaptive operator selection techniques are able to efficiently manage the balance between exploration and exploitation in an evolutionary algorithm, when solving combinatorial optimization problems. We introduce new high level reactive search strategies based on a generic algorithm's controller that is able to schedule the basic variation operators of the evolutionary algorithm, according to the observed state of the search. Our experiments on SAT instances show that reactive search strategies improve the performance of the solving algorithm. 相似文献
8.
In this research, we propose a novel framework referred to as collective game behavior decomposition where complex collective behavior is assumed to be generated by aggregation of several groups of agents following different strategies and complexity emerges from collaboration and competition of individuals. The strategy of an agent is modeled by certain simple game theory models with limited information. Genetic algorithms are used to obtain the optimal collective behavior decomposition based on history data. The trained model can be used for collective behavior prediction. For modeling individual behavior, two simple games, the minority game and mixed game are investigated in experiments on the real-world stock prices and foreign-exchange rate. Experimental results are presented to show the effectiveness of the new proposed model. 相似文献
9.
Much has been said about the fusion of bio-inspired optimization algorithms and Deep Learning models for several purposes: from the discovery of network topologies and hyperparametric configurations with improved performance for a given task, to the optimization of the model’s parameters as a replacement for gradient-based solvers. Indeed, the literature is rich in proposals showcasing the application of assorted nature-inspired approaches for these tasks. In this work we comprehensively review and critically examine contributions made so far based on three axes, each addressing a fundamental question in this research avenue: (a) optimization and taxonomy (Why?), including a historical perspective, definitions of optimization problems in Deep Learning, and a taxonomy associated with an in-depth analysis of the literature, (b) critical methodological analysis (How?), which together with two case studies, allows us to address learned lessons and recommendations for good practices following the analysis of the literature, and (c) challenges and new directions of research (What can be done, and what for?). In summary, three axes – optimization and taxonomy, critical analysis, and challenges – which outline a complete vision of a merger of two technologies drawing up an exciting future for this area of fusion research. 相似文献
10.
Integrating Variable Reduction Strategy With Evolutionary Algorithms for Solving Nonlinear Equations Systems 下载免费PDF全文
Aijuan Song Guohua Wu Witold Pedrycz Ling Wang 《IEEE/CAA Journal of Automatica Sinica》2022,9(1):75-89
Nonlinear equations systems (NESs) are widely used in real-world problems and they are difficult to solve due to their nonlinearity and multiple roots. Evolutionary algorithms (EAs) are one of the methods for solving NESs, given their global search capabilities and ability to locate multiple roots of a NES simultaneously within one run. Currently, the majority of research on using EAs to solve NESs focuses on transformation techniques and improving the performance of the used EAs. By contrast, problem domain knowledge of NESs is investigated in this study, where we propose the incorporation of a variable reduction strategy (VRS) into EAs to solve NESs. The VRS makes full use of the systems of expressing a NES and uses some variables (i.e., core variable) to represent other variables (i.e., reduced variables) through variable relationships that exist in the equation systems. It enables the reduction of partial variables and equations and shrinks the decision space, thereby reducing the complexity of the problem and improving the search efficiency of the EAs. To test the effectiveness of VRS in dealing with NESs, this paper mainly integrates the VRS into two existing state-of-the-art EA methods (i.e., MONES and DR-JADE) according to the integration framework of the VRS and EA, respectively. Experimental results show that, with the assistance of the VRS, the EA methods can produce better results than the original methods and other compared methods. Furthermore, extensive experiments regarding the influence of different reduction schemes and EAs substantiate that a better EA for solving a NES with more reduced variables tends to provide better performance. 相似文献